Implementing Efficient All Solutions SAT Solvers

Efficient Algorithms for Clause-learning Sat Solvers

Boolean satisfiability (SAT) is NP-complete. No known algorithm for SAT is of polynomial time complexity. Yet, many of the SAT instances generated as a means of solving real-world electronic design automation problems are simple enough, structurally, that modern solvers can decide them efficiently. Consequently, SAT solvers are widely used in industry for logic verification. The most robust sol...

Finding Efficient Circuits Using SAT-Solvers

In this paper we report preliminary results of experiments with finding efficient circuits (over binary bases) using SAT-solvers. We present upper bounds for functions with constant number of inputs as well as general upper bounds that were found automatically. We focus mainly on MOD-functions. Besides theoretical interest, these functions are also interesting from a practical point of view as ...

Efficient Data Structures for Fast SAT Solvers

On Proof Systems Behind Efficient SAT Solvers

Conventional algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system. However it has been known since the 1980s that every resolution proof of the pigeonhole principle (PHPm n ), suitably encoded as a CNF instance, includes exponentially many steps[4]. Therefore SAT solvers based upon the DLL procedure [1] or the DP procedure [2] must take exponenti...

Modern Parallel SAT-Solvers

This paper surveys modern parallel SAT-solvers. It focusses on recent successful techniques and points out weaknesses that have to be overcome to exploit the full power of modern multi-core processors.